Transistor Chaining with Integrated Dynamic Folding for 1-D Leaf Cell Synthesis

نویسنده

  • Krzysztof S. Berezowski
چکیده

In this paper, a new method of transistor chaining for 1-D automatic leaf cell synthesis is presented. The method allows synthesis of cells suitable for row-based layouts with no restrictions imposed on network topologies/transistor sizes. The novelty of the solution arises from transistor chaining with integrated dynamic transistor folding. We provide the theoretical analysis of transistor folding, then formulate the problem and solve it using the computational model made after that of [1]. The model serves us as a basis for the novel algorithm constructed using the dynamic programming technique. The preliminary experiments show that the method reaches good quality chainings and the dynamic folding leads to further elimination of the diffusion gaps comparing to the recent results of other researchers. This results in the reduction of the layout width as well as the improvement of its manufacturability and quality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transistor Chainning with Integrated Dynamic Folding for 1-D Leaf Cell Synthesis

In this paper, a new method of transistor chaining for 1-D automatic leaf cell synthesis is presented. The method allows synthesis of cells suitable for row-based layouts with no restrictions imposed on network topologies/transistor sizes. The novelty of the solution arises from transistor chaining with integrated dynamic transistor folding. We provide the theoretical analysis of transistor fol...

متن کامل

A fast transistor-chaining algorithm for CMOS cell layout

We propose a fast algorithm for the transistor-chaining problem in CMOS functional cell layout based on Uehara and van Manuscript received January 4, 1989; revised May 31, 1989. This work was supported in part by ERSO under Contract SF-C-010-1 and by the Cleemput’s layout style [lZ]. Our algorithm takes a transistor-level circuit schematic and outputs a minimum set of transistor chains. Possibl...

متن کامل

Switched-Capacitor Dynamic Threshold PMOS (SC-DTPMOS) Transistor for High Speed Sub-threshold Applications

This work studies the effects of dynamic threshold design techniques on the speed and power of digital circuits. A new dynamic threshold transistor structure has been proposed to improve performances of digital circuits. The proposed switched-capacitor dynamic threshold PMOS (SC-DTPMOS) scheme employs a capacitor along with an NMOS switch in order to effectively reduce the threshold voltage of ...

متن کامل

A Comprehensive Mathematical Model for the Design of a Dynamic Cellular Manufacturing System Integrated with Production Planning and Several Manufacturing Attributes

    Dynamic cellular manufacturing systems,   Mixed-integer non-linear programming,   Production planning, Manufacturing attributes   This paper presents a novel mixed-integer non-linear programming model for the design of a dynamic cellular manufacturing system (DCMS) based on production planning (PP) decisions and several manufacturing attributes. Such an integrated DCMS model with an extensi...

متن کامل

Proofs by Program Transformations

Logic program transformation systems are often described as a collection of unfolding, folding and goal replacement transformation rules. Given a program P , a logic program transformation system derives a sequence of programs P = P0; P1; : : : ; PN , such that for all 0 i < N , Pi+1 is obtained from Pi by application of one of the above rules. Logic program transformation systems are usually p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001